A Framework for Robust Stability of Systems Over Finite Alphabets
نویسندگان
چکیده
منابع مشابه
A Notion of Approximation for Systems over Finite Alphabets
We consider the problem of approximating plants with discrete sensors and actuators (termed ‘systems over finite alphabets’) by deterministic finite memory systems for the purpose of certified-by-design controller synthesis. We propose a new, control-oriented notion of input/output approximation for these systems, that builds on ideas from robust control theory and behavioral systems theory. We...
متن کاملReversals and Transpositions over Finite Alphabets
Extending results of Christie and Irving, we examine the action of reversals and transpositions on finite strings over an alphabet of size k. We show that determining reversal, transposition or signed reversal distance between two strings over a finite alphabet is NP-hard, while for ‘dense’ instances we give a polynomial-time approximation scheme. We also give a number of extremal results, as w...
متن کاملOn Initialization of Finite State ⇢/μ Approximations of Systems Over Finite Alphabets
Abstract— In this paper, we revisit the construction of finite state ⇢/μ approximations for systems over finite alphabets. We derive conditions under which the complexity of these approximations can be lowered by simplifying the initialization process, thus reducing the size (cardinality) of their state-space. For instances where this condition is not met, we propose an alternative construction...
متن کاملClassical wavelet systems over finite fields
This article presents an analytic approach to study admissibility conditions related to classical full wavelet systems over finite fields using tools from computational harmonic analysis and theoretical linear algebra. It is shown that for a large class of non-zero window signals (wavelets), the generated classical full wavelet systems constitute a frame whose canonical dual are classical full ...
متن کاملP Finite Automata and Regular Languages over Countably Infinite Alphabets
We examine the class of languages over countably infinite alphabets characterized by a class of restricted and simplified P automata variants, which we call P finite automata, and show that these classes possess several properties which make them perfect candidates for being the natural extension of the notion of finite automata and that of regular languages to infinite alphabets. To this aim, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2008
ISSN: 0018-9286
DOI: 10.1109/tac.2008.923658